Constant-space, constant-randomness verifiers with arbitrarily small error

Finite State Verifiers with Constant Randomness

We give a new characterization of NL as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change ...

Multi-Oracle Interactive Protocols with Constant Space Verifiers

Multi-oracle interactive protocols are an extension of the Goldwasser-Micali-Rackoff model, in which several infinitely powerful provers interact with a single resource-bounded verifier. In this paper we consider the language recognition power of such protocols and prove that a tinite state verifier can accept any recursively enumerable set both in the multi-prover submodel of Ben-or, Goldwasse...

Hypersurfaces with Constant Mean Curvature in a Lorentzian Space Form

Group Signature with Constant Revocation Costs for Signers and Verifiers

Membership revocation, being an important property for applications of group signatures, represents a bottleneck in today’s schemes. Most revocation methods require linear amount of work to be performed by unrevoked signers or verifiers, who usually have to obtain fresh update information (sometimes of linear size) published by the group manager. We overcome these disadvantages by proposing a n...

‎Spacelike hypersurfaces with constant $S$ or $K$ in de Sitter‎ ‎space or anti-de Sitter space

‎Let $M^n$ be an $n(ngeq 3)$-dimensional complete connected and‎ ‎oriented spacelike hypersurface in a de Sitter space or an anti-de‎ ‎Sitter space‎, ‎$S$ and $K$ be the squared norm of the second‎ ‎fundamental form and Gauss-Kronecker curvature of $M^n$‎. ‎If $S$ or‎ ‎$K$ is constant‎, ‎nonzero and $M^n$ has two distinct principal‎ ‎curvatures one of which is simple‎, ‎we obtain some‎ ‎charact...